Gauss Codes for Graphs
نویسنده
چکیده
Any immersion of the circle into the sphere can be described by a Gauss code, which records the order of the self-intersections along the curve. The problem of which Gauss codes can be realized by closed curves is an old one, and has been solved in several ways. The goal of this paper is to generalize the notion of a Gauss code to look at immersed graphs, and to provide an algorithm for deciding whether a generalized Gauss code can be realized by an immersed graph and, if so, constructing such a realization.
منابع مشابه
Chord Diagrams and Gauss Codes for Graphs
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study of spatial graphs. We will define chord diagrams for planar embeddings of pl...
متن کاملEfficiency of Anti-Hourglassing Approaches in Finite Element Method (TECHNICAL NOTE)
one of the simplest numerical integration method which provides a large saving in computational efforts, is the well known one-point Gauss quadrature which is widely used for 4 nodes quadrilateral elements. On the other hand, the biggest disadvantage to one-point integration is the need to control the zero energy modes, called hourglassing modes, which arise. The efficiency of four different an...
متن کاملA Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages
We introduce simple codes and fast visualization tools for knotted structures in molecules and neural networks. Knots, links and more general knotted graphs are studied up to an ambient isotopy in Euclidean 3-space. A knotted graph can be represented by a plane diagram or by an abstract Gauss code. First we recognize in linear time if an abstract Gauss code represents an actual graph embedded i...
متن کاملOn the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is related to the evaluation of the Jones and Tutte polynomials. We consider the connection between the weight enumerator polynomial from coding theory and Z and expl...
متن کاملA Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book
We introduce simple codes and fast visualization tools for knotted structures in complicated molecules and brain networks. Knots, links and more general knotted graphs are studied up to an ambient isotopy in Euclidean 3-space. A knotted graph can be represented by a plane diagram or a Gauss code. First we recognize in linear time if an abstract Gauss code represents a graph embedded in 3-space....
متن کامل